A MILP-based heuristic for a commercial train timetabling problem
نویسندگان
چکیده
منابع مشابه
A discrete-event optimization framework for mixed-speed train timetabling problem
Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...
متن کاملA Lagrangian heuristic algorithm for a real-world train timetabling problem
The train timetabling problem (TTP) aims at determining an optimal timetable for a set of trains which does not violate track capacities and satisfies some operational constraints. In this paper, we describe the design of a train timetabling system that takes into account several additional constraints that arise in real-world applications. In particular, we address the following issues: • Manu...
متن کاملPassenger Centric Train Timetabling Problem
The aim of this paper is to analyze and to improve the current planning process of the passenger railway service in light of the recent railway market changes. In order to do so, we introduce the Passenger Centric Train Timetabling Problem. The originality of our approach is that we account for the passenger satisfaction in the design of the timetable. We consider both types of timetable(s): cy...
متن کاملTrain Timetabling Problem for Complex Railway Systems
This paper deals with the design of timetables for complex railway systems. Rail transportation has become a rapid, clean and efficient way to transport passengers and freights. A good timetable design is crucial to ensure the quality of the services trying to improve the efficiency of the whole system. Only such a sustainable transportation system will be in accordance to the requirements of f...
متن کاملAn Improvement Heuristic for the Timetabling Problem
This paper formulates a timetabling problem, which is often encountered in a university, as a mathematical programming model. The proposed model combines both teacher assignment and course scheduling problems simultaneously, which causes the entire model to become more complex. We propose an improvement heuristic algorithm to solve such a model. The proposed algorithm has been tested with sever...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Procedia
سال: 2017
ISSN: 2352-1465
DOI: 10.1016/j.trpro.2017.12.118